Completing sort hierarchies
نویسندگان
چکیده
منابع مشابه
Completing Knowledge by Competing Hierarchies
A control strategy for expert systems is presented which is based on Shafer's Belief theory and the combination rule of Dempster. In contrast to well known strategies it is not sequentially and hypotheses-driven, but parallel and self organizing, determined by the concept of information gain. The information gain, calculated as the maximal difference between the actual evidence distribution in...
متن کاملCompleting h
Nearly a decade ago, the science community was introduced to the h-index, a proposed statistical measure of the collective impact of the publications of any individual researcher. Of course, any method of reducing a complex data set to a single number will necessarily have certain limitations and introduce certain biases. However, in this paper we point out that the definition of the hindex act...
متن کاملComparison of Bucket Sort and RADIX Sort
Bucket sort and RADIX sort are two well-known integer sorting algorithms. This paper measures empirically what is the time usage and memory consumption for different kinds of input sequences. The algorithms are compared both from a theoretical standpoint but also on how well they do in six different use cases using randomized sequences of numbers. The measurements provide data on how good they ...
متن کاملPosition Sort
Computer science has many important concepts which are used at a very large scale. It is frequently used by the real life and system applications. Sorting is one of the most important concepts in computer science. Through this paper, we are present a new concept of sorting named "Position Sort" which improves the sorting algorithm by reducing the swapping operation, which directly eff...
متن کاملKeys Per Processor ( n / p ) Radix SortBitonic Sort Sample Sort Simple Radix Sort
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a machine by enumerating the primitive operations that it is capable of performing along with the cost of each operation. Next, we analyze an algorithm by making a precise count of the number of times the algorithm perform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1992
ISSN: 0898-1221
DOI: 10.1016/0898-1221(92)90119-3